Analysis of a p-persistent CSMA packetized cellular network with capture phenomena

نویسندگان

  • Theodore A. Tsiligirides
  • D. G. Smith
چکیده

A p-persistent CSMA protocol suitable for packetized mobile radiotelephone cellular networks with capture and a number of mobile terminals transmitting to a common receiver is considered. In a micro-cellular environment, messages from different transmitting terminals will suffer different attenuations (path loss and fading phenomena), yielding different levels of energy at the receiver. Thus, one out of 'i' attempting transmission packets will be successfully transmitted with some capture probability fi. Assuming that the receiver is within the range and in line-of-sight of all the mobile users in the cell, the capture probabilities can be determined by means of simulation, and a new probabilistic Markov model for the above network is introduced and analysed using the slot property of the channel Under moderate packet length size the results obtained in respect of the throughput-delay performance and stability under heavy traffic conditions are promising compared with those of the corresponding conventional p-persistent CSMA schemes. Consider a finite population of N mobile users sharing one channel for transmission to one receiver (base station). The channel is slotted with slot duration equal to T seconds. Any effect due to the propagation delay is assumed negligible. Each user generates packets of fixed length equal to 0 > 1 slots. Thus, the packet transmission time if OT seconds. Each user stores and attempts to transmit at most one packet for each time slot. A user without a packet in his buffer is said to be free; if he has a packet he is said to be ready. We assume a synchronized structure. Each user generates (or does not generate) a packet in a time slot, independently of other users, with probability cr (or 1-c7). Packet arrivals occur only from free users at the kT instants ;k-1,2 ..... and their number is distributed

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Capacity of p-Persistent CSMA

The CSMA-based algorithms constitute a heart of contemporary wireless media access control technology. In last decades, various enhancements have been introduced to basic CSMA schemes, first of all, in order to support collision avoidance. At the same time, the performance analysis of the p-persistent CSMA has gained a renewed interest recently since the behavior of many CSMA protocols might be...

متن کامل

Random Access Career Sense Protocol: A Comparative Analysis of Non Persistent and 1 Persistent CSMA

In this paper we discussed the simulation based comparative analysis of two random access carrier sense protocol ie. Non persistent CSMA and 1 persistent CSMA in wireless network taking considering of random back off algorithm. The feedback comparison of both protocols compared with respect to load on medium utilization and average waiting time. Both results are demonstrated in different load c...

متن کامل

PERFORMANCE ANALYSIS OF COMPUTER COMMUNICATION NETWORKS VIA RANDOM ACCESS CHANNELS bY

The field of computer communication networks has grown very rapidly in the past few years. One way to communicate is viamultiple access broadcast channels. A new class of random access schemes referred to as the Mp-persistent CSMA scheme is proposed. It incorporates the nonpersistent CSMA scheme and l-persistent CSMA scheme, both slotted and unslotted versions, as its special cases with p=O and...

متن کامل

Neural Network Meta-Modeling of Steam Assisted Gravity Drainage Oil Recovery Processes

Production of highly viscous tar sand bitumen using Steam Assisted Gravity Drainage (SAGD) with a pair of horizontal wells has advantages over conventional steam flooding. This paper explores the use of Artificial Neural Networks (ANNs) as an alternative to the traditional SAGD simulation approach. Feed forward, multi-layered neural network meta-models are trained through the Back-...

متن کامل

Performance Analysis of Markov Modulated 1-Persistent CSMA/CA Protocol with Exponential Backoff Scheduling

This paper proposes a Markovian model of 1-persistent CSMA/CA protocols with K-Exponential Backoff scheduling algorithms. The input buffer of each access node is modeled as a Geo/G/1 queue, and the service time distribution of each individual head-of-line packet is derived from the Markov chain of the underlying scheduling algorithm. From the queuing model, we derive the characteristic equation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Communications

دوره 14  شماره 

صفحات  -

تاریخ انتشار 1991